Optimization of OSPF Weights Using On-line Simulation

نویسندگان

  • Tao Ye
  • Hema Tahilramani Kaur
  • Shivkumar Kalyanaraman
  • Kenneth S. Vastola
  • Saroj Yadav
چکیده

In this paper, we present an OSPF weights optimization scheme using a general automatic network management framework proposed in [1], i.e., on-line simulation framework. We have chosen the packet drop rate in the network as the optimization metric as it is a good indicator of congestion in the network and also impacts the performance of the underlying applications. The packet drop rate has been formulated in terms of the link parameters, such as bandwidth and buffer space, and the parameters of the traffic demands. A GI/M/1/K queuing model has been used to compute the packet drop probability on a given link. We have also developed a fast recursive random search algorithm to address the issues associated with network optimization problems. The search algorithm has been compared to the local search heuristic of [4] in terms of the number of function evaluations needed to obtain a “good” OSPF link weight setting. Our results demonstrate that the recursive random search takes 50-90% fewer function evaluations to find a “good” setting. The amount of improvement depends on the network topology, traffic conditions and optimization metric. We have simulated the proposed OSPF optimization scheme in ns[19] and the results indicated improvements of the order of 30-60% in the total packet drop rate. Index Terms Traffic Engineering, OSPF, Optimization 2

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimizing Packet Loss by Optimizing OSPF Weights Using Online Simulation

In this paper, we present a scheme for minimizing the packet loss in an OSPF network by optimizing link weights using Online Simulation. For this work we have chosen packet loss rate in the network as the optimization metric as it is a good indicator of congestion and impacts the performance of the underlying applications. We have formulated packet loss rate in the network in terms of the link ...

متن کامل

Dynamic Optimization of OSPF Weights using Online Simulation

In this paper, we address the issues associated with the dynamic optimization of OSPF weights. For this work we have chosen the packet loss rate in the network as the optimization metric as it is a good indicator of congestion in the network and also impacts the performance of the underlying applications. The packet loss rate has been formulated in terms of the link parameters, such as bandwidt...

متن کامل

Efficient OSPF Weight Allocation for Intra-domain QoS Optimization

This paper presents a traffic engineering framework able to optimize OSPF weight setting administrative procedures. Using the proposed framework, enhanced OSPF configurations are now provided to network administrators in order to effectively improve the QoS performance of the corresponding network domain. The envisaged NP-hard optimization problem is faced resorting to Evolutionary Algorithms, ...

متن کامل

Class-Based OSPF Traffic Engineering Inspired on Evolutionary Computation

This paper proposes a novel traffic engineering framework able to automatically provide near-optimal OSPF routing configurations for QoS constrained scenarios. Within this purpose, this work defines a mathematical model able to measure the QoS compliance in a class-based networking domain. Based on such model, the NP-hard optimization problem of OSPF weight setting is faced resorting to Evoluti...

متن کامل

An integer programming approach to the OSPF weight setting problem∗

Under the Open Shortest Path First (OSPF) protocol, traffic flow in an Internet Protocol (IP) network is routed on the shortest paths between each source and destination. The shortest path is calculated based on pre-assigned weights on the network links. The OSPF weight setting problem is to determine a set of weights such that, if the flow is routed based on the OSPF protocol, some measure of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002